Symmetric line coding

ABSTRACT

A method an apparatus for symmetric line coding is provided where a binary input signal d is received; a value for each of a pair of binary bits p and q are dynamically defined in response to the input stream; and a pair of output bitstreams v 1  and v 2  are dynamically generated in accordance with the following: if d=1, then v 1 =p and v 2 =p, and if d=0, then v 1 =(1−q) and v 2 =q.  
     In illustrative embodiments of the invention, the generation may be performed by symmetric-line coding machines, including: a bitstream symmetric line coding machine, a regular bitstream symmetric line coding machine, a complementary regular bitstream symmetric line coding machine, a binary complementary regular symmetric line coding machine, a bitstream parallel symmetric line coding machine, a regular bitstream parallel symmetric line coding machine, a complementary regular bitstream parallel symmetric line coding machine, and a binary complementary regular parallel symmetric line coding machine.

STATEMENT OF RELATED APPLICATION

[0001] This application claims the benefit of priority to U.S. Provisional Patent Application No. 60/277,026, filed Mar. 19, 2001, entitled “SYMMETRIC LINE CODING”.

BACKGROUND OF THE INVENTION

[0002] High bandwidth optical communications systems typically use continuous wave (“CW”) lasers, passing through an intensity modulator, to encode and transmit data. The light emitted by the laser has a very narrow frequency spread, characteristic of a coherent light source. The modulator is driven by high bandwidth electrical signals. These signals spread the frequency spectrum of the light to roughly twice the bandwidth of the modulating electrical signals. However, generating these high bandwidth electrical signals is expensive using conventional arrangements, and the resulting spread of the optical spectrum limits the spacing of separate frequency channels in a wavelength division multiplexed system.

SUMMARY OF THE INVENTION

[0003] The aforementioned problems are addressed by an arrangement for symmetric line coding in accordance with the invention. A method an apparatus for symmetric line coding is provided where a binary input signal d is received; a value for each of a pair of binary bits p and q are dynamically defined in response to the input stream; and a pair of output bitstreams v₁ and v₂ are dynamically generated in accordance with the following: if d=1, then v₁=p and v₂=p, and if d=0, then v₁=(1−q) and v₂=q.

[0004] In illustrative embodiments of the invention, the generation may be performed by symmetric-line coding machines, including: a bitstream symmetric line coding machine, a regular bitstream symmetric line coding machine, a complementary regular bitstream symmetric line coding machine, a binary complementary regular symmetric line coding machine, a bitstream parallel symmetric line coding machine, a regular bitstream parallel symmetric line coding machine, a complementary regular bitstream parallel symmetric line coding machine, and a binary complementary regular parallel symmetric line coding machine.

[0005] In other illustrative embodiments, the inventive arrangment is couple to a modulator, for example a Mach-Zender modulator.

[0006] Advantageously, the arrangement of the present invention reduces the bandwidth requirements of the electrical signals, so that these signals are more easily produced, and further reduces the spread of the optical spectrum, so that channels may be spaced more closely.

BRIEF DESCRIPTION OF THE DRAWING

[0007]FIG. 1 depicts a simplified block diagram of an illustrative embodiment of a Binary Complementary Regular Bitstream symmetric line coding machine in accordance with the invention;

[0008]FIG. 2 depicts simplified block diagrams of driver circuits that are operationally coupled with modulators in accordance with the invention;

[0009]FIG. 3 depicts an illustrative block diagram of an 8 bit-parallel bus symmetric line coding machine in accordance with the invention.

DETAILED DESCRIPTION

[0010] Most systems use a signaling format known as On-Off Keying (“OOK”). In OOK, the light from a laser is modulated such that a low amplitude signal represents one logical state (a “0” state, for instance), while a high amplitude signal represents another logical state (a “1” state). These two logical states, representing the data bit values 0 and 1, are propagated along the transmission line repetitively once each clock period (sampling instant), T. Equipment at the receiving terminal detects the intensity of the light signal, reconstructs the clock, samples the light intensity at each clock interval, and decides whether a 0 or 1 data bit was transmitted.

[0011] The electric field of the light modulated onto the optical fiber may be described according to its radio-frequency (“RF”) electric field envelope and the underlying optical carrier field. The envelope contains the RF field amplitude, together with the complex phase of the field. An OOK signal has an envelope that takes on values of 0 or 1 at each sampling instant. More complex line codes take on other values at each sampling instant. For instance, phase shift keying takes on values in the set {−1, +1}, while Alternate Mark Inversion (“AMI”) takes on values in {−1,0, +1}.

[0012] The envelope may be represented as a data symbol multiplied into a unit modulation pulse. In this way, a Non-Return-to-Zero (“NRZ”) OOK signal may be represented as a full duty cycle modulation pulse, multiplied by a data amplitude in the set {0,1}. This may be expressed as the convolution of the unit modulation pulse with a train of impulses, each carrying a weight given by the data amplitude.

[0013] The power spectrum of the light on the transmission fiber is determined from the RF envelope. When the envelope is represented as the convolution of modulation pulse and data amplitude impulse train, the power spectrum is simply the product of the Fourier transform of the modulation pulse and that of the impulse train. The transform of the impulse train is expressed in terms of its autocorrelation. For this reason, correlations in the data amplitudes introduce structure into the transmission power spectrum. It is control of these correlations, and the associated shaping of the power spectrum, that is the goal of line coding.

[0014] The optical power spectrum of the transmission may be calculated from the autocorrelation of the line code. The electric field envelope, E(t), is made up of unit modulation pulses, emitted at each clock period, T, weighted by the output symbols, b_(k). This may be written as a convolution of an impulse train, weighted by the output amplitudes, with the unit modulation pulse,

E(t)=Σb _(k) ·p(t−kT)=Σb _(k)·δ(t−kT){circle over (×)}p(t).

[0015] The power spectral density is the product of the line code spectral density and that of the unit modulation pulse,

S(ω)=S _(L)(ω)·|P(ω)|².

[0016] The line code power spectral density is, explicitly, $\begin{matrix} {{{S_{L}(\omega)} = {\frac{1}{T}{\sum\limits_{n = {- \infty}}^{\infty}{R_{n}e^{i\quad n\quad \omega \quad T_{0}}}}}},{{\text{for}\quad R_{n}} = {\langle{b_{k}b_{k + n}^{*}}\rangle}},} & (1) \end{matrix}$

[0017] where the autocorrelation coefficient, R_(n), is calculated over the statistical expectation of output symbol products. The unit modulation pulse spectral density is P(ω) = ∫_(−∞)^(∞)p(t)e^(−i  ω  t).

[0018] The line code power spectral density, S_(L)(ω), provides a means to control the spectrum of the transmission by controlling the correlations between output symbols. These relations demonstrate that spectral shaping may be effected without changing the modulation pulse itself. The intellectual property contained in this document will comprise invention of spectral shaping line codes, and their implementations, to control the spectrum of transmission of optical signals, and the mitigation of impairments suffered in propagating through optical fiber.

[0019] The line code power spectral density may be computed for OOK, $\begin{matrix} {{{S_{OOK}(\omega)} = {\frac{1}{4T} + {\frac{2\quad \pi}{4T^{2}}{\sum\limits_{n = {- \infty}}^{\infty}{\delta \left( {\omega - \frac{2\pi \quad n}{T}} \right)}}}}},} & (2) \end{matrix}$

[0020] where the first term on the right hand side represents a flat frequency-independent spectrum, and the second term, narrow peaks at multiples of the clock frequency. The flat spectrum uses requires bandwidth out to very high frequencies, causing channels to be broadly spaced. The narrow spectral peaks, which result from the phase coherence of the light source, are problematic due to nonlinear propagation effects in optical fibers. Both of these issues are addressed by line coding.

[0021] The power spectral density for the ASI line code is $\begin{matrix} {{{S_{ASI}(\omega)} = {{\frac{1}{4T}\left( {1 + {\cos \quad \omega \quad T}} \right)} = {\frac{1}{2\quad T}\cos^{2}\frac{\omega \quad T}{2}}}},} & (3) \end{matrix}$

[0022] from which it is evident that the spectrum has been shaped to have a null at the Nyquist frequency, $\omega_{Nyquist} = {\frac{\pi}{T}.}$

[0023] This narrows the spectral bandwidth, and allows closer channel spacing. It also reduces the impact of dispersive propagation impairments.

[0024] Each bit of the output symbol may be mapped onto the contacts of a Mach-Zehnder (“MZ”) modulator. The MZ modulator divides the incoming light into two waveguides, applies a variable and independent phase shift, φ₁ and φ₂, to each, and recombines them at the output. The effect is to generate an optical field at the output with electric field envelope proportional to

E□[exp(iπ·φ₁)+exp(iπ·φ₂)]/2.

[0025] The phase shifts may be configured such that, for two input bits, v₁ and v₂, the phase shits satisfy φ₁=(v₁+v₂)/2 and φ₂=−(v₁+v₂)/2, so that ${E\quad \bullet \quad {\cos \left( {\pi \cdot \frac{v_{1} + v_{2}}{2}} \right)}},$

[0026] so that the sum of the two input bits determines the output state. When (V₁, V₂)=(0,0), then E□1; when (v₁, v₂)=(0,1) or (v₁, v₂)=(1,0) then E□0; and when (v₁, v₂)=(1,1), then E□−1. Alternatively, the phase shifts may be configured such that φ₁=(v₁−v₂)/2 and φ₂=−(v₁−v₂)/2, and the difference of the output bits determine the modulator output. Other alternatives include complementing either or both of the output bits, v₁ and v₂.

[0027] The ability to drive a modulator with the sum or difference of two output bits enables the following beneficial aspect: transitions in the output of the modulator may be effected by transitions of either of the two inputs, independently. This provides a means to reduce the frequency with which the two binary inputs make transitions. This translates directly into reduced requirements for the electronic and optical components. In order to take advantage of this opportunity, some method of signal processing is required to produce the correct signals, v₁ and V₂, to be used to drive the modulator contacts. This method is line coding, a broad category of which will be described by symmetric line coding machines.

[0028] The symmetric line coding machine of the present invention may be described in the following way. The unique input symbols form a set, {d₁, . . . , d_(n)}. For each input symbol, there is associated a pair of output symbols, forming a set, {{P₁,Q₁}, . . . , {P_(n),Q_(n)}}. Each time the machine receives an input symbol, d_(k), it produces an output symbol from the appropriate set, {P_(k),Q_(k)}. The symbols P_(k) and Q_(k) may, or may not, be unique. For at least one k, P_(k) and Q_(k) must differ.

[0029] For each k, the first time that input d_(k) is received, output P_(k) is produced. Subsequently, for each k, whenever input d_(k) is received, either P_(k) or Q_(k) is output, according to the following rule. Upon receiving input d_(k), determine the most recent prior occurrence of the same input d_(k), and which output symbol, from the set {P_(k),Q_(k)}, was produced for that input. If the number of intervening input symbols, between the current input d_(k) and the most recent prior occurrence of d_(k), is an odd number, then produce whichever output symbol, from the set {P_(k),Q_(k)}, was not emitted in the most recent prior instance of input d_(k). Otherwise, produce the same output symbol, from the set {P_(k),Q_(k)}, that was emitted in the most recent prior instance of input d_(k).

[0030] An example of such a machine follows. Let the input symbol set be {d₁, d₂, d₃}, and the output set be {{P₁,Q₁}, {P₂,Q₂}, {P₃,Q₃}}. Suppose the input symbol sequence is d₁ d₂ d₃ d₁ d₃ d₃. Then the output sequence would be P₁ P₂ P₃ P₁ Q₃ Q₃. The first output is P₁, since it is the first instance of input d₁. The second output is P₂, since it is the first instance of input d₂. The third output is P₃, since it is the first instance of input d₃. The fourth input is d₁, so count the number of input symbols between this instance of d₁ and the most recent prior instance of d₁, at which time output P₁ was produced. There are two such inputs, d₃ and d₂, so the same output symbol, P₁, is produced as was produced most recently when input d₁ was received. The fifth input is d₃, for which there is one other symbol, d₁, intervening between this input and the most recent prior input of d₃, for which the output symbol was P₃. One is an odd number, so the output symbol is not P₃, but instead is Q₃. The sixth input is d₃, corresponding to output symbol Q₃. The immediately prior input was d₃, also, so there are zero other symbols intervening. Zero is not an odd number, so the output symbol is the same as for that input, Q₃.

[0031] Several specific symmetric line coding machine machines are now described.

[0032] The Bitstream symmetric line coding machines is a symmetric line coding machines in which each input symbol, d_(k), is a sequence of binary digits (bits). Likewise, each output is a sequence of bits.

[0033] The Regular Bitstream symmetric line coding machine is a symmetric line coding machine in which each input symbol, d_(k), is a sequence of n bits, and each output symbol is a unique sequence of n+1 bits.

[0034] The Complementary Regular Bitstream symmetric line coding machine is a symmetric line coding machine in which each input symbol, d_(k), is a sequence of n bits, each output symbol is a unique sequence of n+1 bits, and for each input symbols, d_(k), the two corresponding output symbols, P_(k) and Q_(k), are bitwise complements of each other.

[0035] The Binary Complementary Regular Bitstream symmetric line coding machine is a Complementary Regular Bitstream symmetric line coding machine with n=1.

[0036] An illustrative embodiment of the Binary Complementary Regular Bitstream symmetric line coding machine is depicted in FIG. 1. The binary input, d, is processed to produce binary output pairs, (v₁,v₂).

[0037] The symmetric line coding modulator, in accordance with the invention, is the application of each of the output bits of a Binary Complementary Regular Bitstream symmetric line coding machine to the two contacts of a MZ modulator, as depicted in FIG. 2. The two output bits are amplified by drive amplifiers, and the resulting signal applied to the contacts of the modulator. The power spectrum of the electrical signal applied to each contact of the modulator is described by Eq (3). For the symmetric line coding machines Modulator, the electric field envelope of the optical transmission is described by the ASI line code. The optical spectrum is also described by Eq. (3), so that a null is driven into the power spectrum of the transmitted light. This significantly lowers the high frequency content of the transmission, producing narrower channels, and allowing channels to be more closely spaced.

[0038] Parallel symmetric line coding machines are now described.

[0039] It may be desirable to have the input symbols presented to the symmetric line coding machine on a set of N parallel input lines, and the symmetric line coding machine output applied onto a set of M parallel output lines. At the input, a rule is established for identifying the sequence order of the inputs on each of the parallel input lines; at the output, a rule is established for identifying the sequence order of the outputs on each of the parallel output lines. Given these two rules, the contents of the input lines are processed to produce the contents of the output lines according to the operation of a symmetric line coding machine.

[0040] Several specific parallel-symmetric line coding machine are now described.

[0041] The Bitstream parallel-symmetric line coding machine is a parallel-symmetric line coding machine in which each input symbol, d_(k), is a sequence of binary digits (bits). Likewise, each output is a sequence of bits.

[0042] The Regular Bitstream parallel-symmetric line coding machine is a parallel-symmetric line coding machine in which each input symbol, d_(k), is a sequence of n bits, and each output symbol is a unique sequence of n+1 bits.

[0043] The Complementary Regular Bitstream parallel-symmetric line coding machine is a parallel-symmetric line coding machine in which each input symbol, d_(k), is a sequence of n bits, each output symbol is a unique sequence of n+1 bits, and for each input symbols, d_(k), the two corresponding output symbols, P_(k) and Q_(k), are bitwise complements of each other.

[0044] The Binary Complementary Regular Bitstream parallel-symmetric line coding machine is a Complementary Regular Bitstream parallel-symmetric line coding machine with n=1.

[0045] An illustrative embodiment of Binary Complementary Regular Bitstream parallel-symmetric line coding machine is now described.

[0046] An embodiment of a parallel symmetric line coding machine, shown in FIG. 3, teaches how to construct logic for an 8-bit parallel bus. The inputs, labeled d₀ through d₇, are processed to produce the outputs, labeled v1 ₀ through v1 ₇ and v2 ₀ through v2 ₇. The output symbol pairs are (v1,v2). The ordering is first d₀, next d₁, . . . , finally (d₇, and likewise on the output.

[0047] Other embodiments of the invention may be implemented in accordance with the claims that follow. 

What is claimed is:
 1. A method comprising the steps of: receiving a binary input stream d; dynamically defining the value for each of a pair of binary bits p and q in response to the binary input stream d; and dynamically generating an output pair of bitstreams, v₁, and v₂, where the generating is performed in accordance with the following (a) for a binary input d of a value, then both v₁ and v₂ are supplied with same value of either binary bit p or binary bit q, and (b) for a complement to the value of binary input d, then supply to the output pair, a value of an other binary bit p or q that was not supplied in step (a) and a complement to the other binary bit p or q.
 2. A method comprising the steps of: receiving a binary input stream d; dynamically defining a value for each of a pair of binary bits p and q in response to the binary input stream d; and dynamically generating the output pair of bitstreams as an output, v₁ and v₂, where the generating is performed in accordance with the following (a) if d=1, then v₁=p and v₂=p, and (b) if d=0, then v₁=(1−q) and v₂=q.
 3. A symmetric line coding apparatus, comprising: an input port for receiving a binary input signal d; a circuit coupled to the input port to dynamically define a value for each of a pair of binary bits p and q in response to the binary input stream d; a pair of output ports coupled to the circuit, whereby the circuit dynamically generates an pair of bitstreams, v₁ and v₂, for output at the pair of outputs ports and the generating is performed in accordance with the following (a) for a binary input d of a value, then both v₁ and v₂ are supplied with same value of either binary bit p or binary bit q, and (b) for a complement to the value of binary input d, then supply to the output pair, a value of an other binary bit p or q that was not supplied in step (a) and a complement to the other binary bit p or q.
 4. A symmetric line coding apparatus, comprising: an input port for receiving a binary input signal d; a circuit coupled to the input port to dynamically define a value for each of a pair of binary bits p and q in response to the binary input stream d; a pair of output ports coupled to the circuit, whereby the circuit dynamically generates an pair of bitstreams, v₁ and v₂, for output at the pair of outputs ports and the generating is performed in accordance with the following (a) if d=1, then v₁=p and V₂=p, and (b) if d=0, then v₁=(1−q) and v₂=q.
 5. The apparatus according to claim 4 further including a data latch coupled to the input port to latch the state of the input bit stream at each clock cycle.
 6. The apparatus of claim 4 further including a switch coupled to each output port for selecting the value of an output bitstream supplied at each the output ports.
 7. The apparatus of claim 3 further including a dual input modulator coupled to the respective output ports.
 8. The apparatus of claim 7 whereby the modulator is a Mach-Zender modulator.
 9. A symmetric line coding apparatus, comprising: an input port for receiving a binary input signal d; a circuit coupled to the input port to dynamically define a value for each of a pair of binary bits p and q in response to the binary input stream d; a pair of output ports coupled to the circuit, whereby the circuit dynamically generates an pair of bitstreams, v₁ and v₂, for output at the pair of outputs ports and the generating is performed using a symmetric line coding machine.
 10. The apparatus of claim 9 where the symmetric line coding machine is a regular bitstream symmetric line coding machine.
 11. The apparatus of claim 9 where the symmetric line coding machine is a complementary regular bitstream symmetric line coding machine.
 12. The apparatus of claim 9 where the symmetric line coding machine is a binary complementary regular bitstream symmetric line coding machine.
 13. The apparatus of claim 9 where the symmetric line coding machine includes a set of N parallel input lines and M parallel output lines.
 14. The apparatus of claim 13 where the symmetric line coding machine machine includes a set of N parallel input lines and M parallel output lines is bitstream parallel-symmetric line coding machine.
 15. The apparatus of claim 13 where the symmetric line coding machine machine includes a set of N parallel input lines and M parallel output lines is regular bitstream parallel-symmetric line coding machine.
 16. The apparatus of claim 13 where the symmetric line coding machine machine includes a set of N parallel input lines and M parallel output lines is a complementary bitstream parallel-symmetric line coding machine.
 17. The apparatus of claim 13 where the symmetric line coding machine machine includes a set of N parallel input lines and M parallel output lines is a binary complementary regular bitstream parallel-symmetric line coding machine.
 18. The apparatus of claim 13 where the symmetric line coding machine machine includes a set of N parallel input lines and M parallel output lines and N=8 and M=8. 